Solving NP-hard problems in ‘almost trees’: Vertex cover
نویسندگان
چکیده
منابع مشابه
Human Performance on Hard Non-Euclidean Graph Problems: Vertex Cover
Recent studies on a computationally hard visual optimization problem, the Traveling Salesperson Problem (TSP), indicate that humans are capable of finding close to optimal solutions in near-linear time. The current study is a preliminary step in investigating human performance on another hard problem, the Minimum Vertex Cover Problem, in which solvers attempt to find a smallest set of vertices ...
متن کاملIterative Compression for Exactly Solving NP-Hard Minimization Problems
We survey the conceptual framework and several applications of the iterative compression technique introduced in 2004 by Reed, Smith, and Vetta. This technique has proven very useful for achieving a number of recent breakthroughs in the development of fixed-parameter algorithms for NP-hard minimization problems. There is a clear potential for further applications as well as a further developmen...
متن کاملA Graphical Approach for Solving NP-Hard Combinatorial Problems
In this paper we consider a graphical realization of dynamic programming. The concept is discussed on the partition and knapsack problems. In contrast to dynamic programming, the new algorithm can also treat problems with non-integer data without necessary transformations of the corresponding problem. We compare the proposed method with existing algorithms for these problems on small-size insta...
متن کاملWisdom of artificial crowds algorithm for solving NP-hard problems
The paper describes a novel algorithm, inspired by the phenomenon of wisdom of crowds, for solving instances of NP-hard problems. The proposed approach achieves superior performance compared to the genetic algorithm-based approach and requires modest computational resources. On average, a 6%–9% improvement in quality of solutions has been observed.
متن کاملA Hardware Relaxation Paradigm for Solving NP-Hard Problems
Digital circuits with feedback loops can solve some instances of NP-hard problems by relaxation: the circuit will either oscillate or settle down to a stable state that represents a solution to the problem instance. This approach differs from using hardware accelerators to speed up the execution of deterministic algorithms, as it exploits stabilisation properties of circuits with feedback, and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1985
ISSN: 0166-218X
DOI: 10.1016/0166-218x(85)90057-5